On Edge Intersection Graphs of Paths with 2 Bends
نویسندگان
چکیده
An EPG-representation of a graph G is a collection of paths in a plane square grid, each corresponding to a single vertex of G, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In this paper we focus on graphs admitting EPG-representations by paths with at most 2 bends. We show hardness of the recognition problem for this class of graphs, along with
منابع مشابه
Graphs of edge-intersecting and non-splitting paths
The families of Edge Intersection Graphs of Paths in a tree (resp. in a grid) EPT (resp. EPG) are well studied graph classes. Recently we introduced the class of graphs of Edge-Intersecting and NonSplitting Paths in a Tree (ENPT) [2]. In this model, two vertices are adjacent if they represent two intersecting paths of a tree whose union is also a path. In this study we generalize this graph cla...
متن کاملEdge intersection graphs of systems of grid paths with bounded number of bends
We answer some of the questions raised by Golumbic, Lipshteyn and Stern regarding edge intersection graphs of paths on a grid (EPG graphs). We prove that for any d ≥ 4, in order to represent all n vertex graphs with maximum degree d as edge intersection graphs of n paths, a grid of area Θ(n2) is needed. A bend is a turn of a path at a grid point. Let Bk be the class of graphs that have an EPG r...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملOn the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Golumbic, Lipshteyn and Stern proved that every graph can be represented as the edge intersection graph of paths on a grid, i.e., one can associate to each vertex of E-mail addresses: [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]. This work was partially supported by MathAmSud...
متن کاملEdge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications in conflict resolution of paths in grid networks. In this paper, we continue the study of edge-intersection graphs of paths in a grid, which was ...
متن کامل